An Eecient Token-based Algorithm for Distributed Mutual Exclusion
نویسندگان
چکیده
In this paper, we present an eecient token-based algorithm for distributed mutual exclusion. The algorithm uses a distributed queue, which is not necessarily FIFO, to enqueue the request messages of the nodes for entry into the critical section (CS). These request messages are timestamped using roughly synchronized clocks. On the average, the algorithm requires 2 to 3 number of messages per critical section entry over a wide range of workloads and a few additional number of messages at lower loads for large networks. This is in contrast to the existing algorithms in the literature which require around O(n) number of messages at higher or lower loads, where n is the number of nodes in the system. The algorithm is deadlock-free and starvation-free.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملA Centralized Token-Based Algorithm for Distributed Mutual Exclusion
In this paper, we present a new algorithm for distributed mutual exclusion that combines the advantages of existing centralized and token-based algorithms: it takes only two messages to acquire the lock when it is not held by another process, and only one message to pass the lock from one process to another. At the same time, our algorithm generates signiicantly less message traac than non-cent...
متن کاملComparative Study of Mutual Exclusion Algorithms in Distributed Systems
Mutual Exclusion is an important phenomenon in distributed systems. In this paper, we analyze and compare various mutual exclusion algorithms in distributed systems. In permission based mutual exclusion process waits for permission from other processes to enter into a critical section. In token based mutual exclusion, a special message called token is passed over the system and process holding ...
متن کاملColor Optimal Self-Stabilizing Depth-First Token Circulation
The notion of self-stabilization was rst introduced by Dijkstra : it is the property for a system to eventually recover itself a legitimate state after any perturbation modifying the memory state. This paper proposes a self-stabilizing depth-rst token circulation protocol for uniform rooted networks. Such an algorithm is very convenient to obtain the mutual exclusion or to construct a spanning ...
متن کاملImprovement of the distributed algorithms of mutual exclusion by introducing the priority
Most of distributed mutual exclusion algorithms do not use the notion of priority. To solve the distributed prioritized mutual exclusion problem, F. Mueller[9] has already prioritized a token and tree based algorithm. The goal of this paper is to show the introduction of priority in an other token-based algorithm. This work can be considered an improvement of F.
متن کامل